Sliding into Winning Compositions

Sliding Right into Disaster: Left-to-Right Sliding Windows Leak

It is well known that constant-time implementations of modular exponentiation cannot use sliding windows. However, software libraries such as Libgcrypt, used by GnuPG, continue to use sliding windows. It is widely believed that, even if the complete pattern of squarings and multiplications is observed through a side-channel attack, the number of exponent bits leaked is not sufficient to carry o...

Sliding Into Jewishness: A Pentimento of Portamento

Toward Integrating Social Trust into Web Service Compositions

Web 2.0 helped bring about the development of social communities, Web services and a host of applications. Web service compositions traditionally utilize the functional and quality-of-service parameters of candidate services to decide which services to include in the composition. However, users of services often form an opinion of a service. User-driven composition techniques will form composit...

INVERSE-CONJUGATE COMPOSITIONS INTO PARTS OF SIZE AT MOST k

An inverse-conjugate composition of a positive integer m is an ordered partition of m whose conjugate coincides with its reversal. In this paper we consider inverseconjugate compositions in which the part sizes do not exceed a given integer k. It is proved that the number of such inverse-conjugate compositions of 2n − 1 is equal to 2F n , where F (k) n is a Fibonacci k-step number. We also give...

Compositions versus Cyclic Compositions

We prove that the sum of greatest common divisors of parts in all compositions of n equals the sum of lengths of all cyclic compositions of n. The proof highlights structural similarities between the set of compositions of n and the set of cyclic compositions of n. 1. Definitions and Statement A composition of the positive integer n is an ordered partition of n; that is, a vector ( ) r p p ...,...